Polar and Nonpolar Sets for a Tree Indexed Process
نویسندگان
چکیده
منابع مشابه
Polarity inversion in polar-nonpolar-polar heterostructures.
We have observed an epilayer-thickness-dependent polarity inversion for the growth of CdTe on Sb(Bi)/CdTe(111)B. For films with Sb(Bi) thicknesses of less than 40 A (15 A), the CdTe layer shows a B (Te-terminated) face, but it switches to an A (Cd-terminated) face for thicker layers. On the other hand, a CdTe layer grown on Bi(Sb)/CdTe(111)A always shows the A face regardless of Sb or Bi layer ...
متن کاملAntimicrobial activities of semi polar-nonpolar and polar secondary metabolites of sponge Dysidea pallescens from Hengam Island, Persian Gulf
Sponges are the simplest multicellular animals that lack defense mechanisms and rely on chemical defense that have been used by mankind to develop antimicrobial drugs against diseases. The present study was designed to demonstrate the antibacterial and antifungal activities of marine sponge Dysidea pallescens semipolar and nonpolar extracts. In this study, D. pallescens were collected from He...
متن کاملAntimicrobial activities of semi polar-nonpolar and polar secondary metabolites of sponge Dysidea pallescens from Hengam Island, Persian Gulf
Sponges are the simplest multicellular animals that lack defense mechanisms and rely on chemical defense that have been used by mankind to develop antimicrobial drugs against diseases. The present study was designed to demonstrate the antibacterial and antifungal activities of marine sponge Dysidea pallescens semipolar and nonpolar extracts. In this study, D. pallescens were collected from He...
متن کاملSome Strong Deviation Theorems for Stochastic Process Indexed by a Tree
In this paper we introduce a concept of asymptotic log-likelihood ratio as a measure of deviation of the joint distribution from the product of their margins, we give the generalized strong law of large numbers (strong law expressed by inequalities, i.e. strong deviation theorems) for stochastic process indexed by a tree. As corollaries, we obtain some known results.
متن کاملFinger Indexed Sets: New Approaches
In the particular case we have insertions/deletions at the tail of a given set S of n one-dimensional elements, we present a simpler and more concrete algorithm than that presented in [Anderson, 2007] achieving the same (but also amortized) upper bound ofO( √ logd/loglogd) for finger searching queries, where d is the number of sorted keys between the finger element and the target element we are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 1992
ISSN: 0091-1798
DOI: 10.1214/aop/1176989792